Constrained adaptive filtering algorithms based on conjugate gradient techniques for beamforming

نویسندگان

  • L. Wang
  • R. C. de Lamare
چکیده

This article proposes constrained adaptive algorithms based on the conjugate gradient (CG) method for adaptive beamforming. The proposed algorithms are derived for the implementation of the beamformer according to the minimum variance and constant modulus criteria subject to a constraint on the array response. A CG-based weight vector strategy is created for enforcing the constraint and computing the weight expressions. The devised algorithms avoid the covariance matrix inversion and exhibit fast convergence with low complexity. A complexity analysis compares the proposed algorithms with the existing ones. The convergence properties of the CCM criterion are studied, conditions for convexity are established and a convergence analysis for the proposed algorithms is derived. Simulation results are conducted for both stationary and non-stationary scenarios, showing the convergence and tracking ability of the proposed algorithms. 6

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-Membership Constrained Conjugate Gradient Beamforming Algorithms

In this work a constrained adaptive filtering strategy based on conjugate gradient (CG) and set-membership (SM) techniques is presented for adaptive beamforming. A constraint on the magnitude of the array output is imposed to derive an adaptive algorithm that performs data-selective updates when calculating the beamformer’s parameters. We consider a linearly constrained minimum variance (LCMV) ...

متن کامل

Set-Membership Conjugate Gradient Constrained Adaptive Filtering Algorithm for Beamforming

We introduce a new linearly constrained minimum variance (LCMV) beamformer that combines the set-membership (SM) technique with the conjugate gradient (CG) method, and develop a low-complexity adaptive filtering algorithm for beamforming. The proposed algorithm utilizes a CG-based vector and a variable forgetting factor to perform the dataselective updates that are controlled by a time-varying ...

متن کامل

Robust Adaptive Beamforming Algorithms Based on the Constrained Constant Modulus Criterion

We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worstcase beamformer with the minimum variance design, the problem can be reformulated as a second-order cone (SOC) program and solved with interior point methods. An anal...

متن کامل

Robust Adaptive Beamforming Algorithms using the Constrained Constant Modulus Criterion

We present a robust adaptive beamforming algorithm based on the worst-case criterion and the constrained constant modulus approach, which exploits the constant modulus property of the desired signal. Similarly to the existing worst-case beamformer with the minimum variance design, the problem can be reformulated as a secondorder cone (SOC) program and solved with interior point methods. An anal...

متن کامل

Study of Efficient Robust Adaptive Beamforming Algorithms Based on Shrinkage Techniques

This paper proposes low-complexity robust adaptive beamforming (RAB) techniques based on shrinkage methods. We firstly briefly review a Low-Complexity Shrinkage-Based Mismatch Estimation (LOCSME) batch algorithm to estimate the desired signal steering vector mismatch, in which the interference-plus-noise covariance (INC) matrix is also estimated with a recursive matrix shrinkage method. Then we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010